Graph matching with hierarchical discrete relaxation
نویسندگان
چکیده
منابع مشابه
Graph Matching with Hierarchical Discrete Relaxation
Our aim in this paper is to develop a Bayesian framework for matching hierarchical relational models. Such models are widespread in computer vision. The framework that we adopt for this study is provided by iterative discrete relaxation. Here the aim is to assign the discrete matches so as to optimise a global cost function that draws information concerning the consistency of match from dieren...
متن کاملHierarchical matching using relaxation
In this paper we outline the application of a general relaxation-based matching procedure to the problem of matching pairs of images and discuss the extension of the basic technique to mat&kg hierarchid descriptions of scenes. Q 1986 Academic Press. Inc.
متن کاملRelational Matching by Discrete Relaxation
This paper describes a symbolic approach to relational matching. The novelty of the method lies in its Bayesian modelling of relational consistency through the use of an explicit constraint corruption process. Unlike many alternatives in the literature, the method is not limited to the use of binary constraints; it can accommodate N-ary relations of varying order. In consequence of this assumed...
متن کاملStructural Matching by Discrete Relaxation
This paper describes a Bayesian framework for performing relational graph matching by discrete relaxation. Our basic aim is to draw on this framework to provide a comparative evaluation of a number of contrasting approaches to relational matching. Broadly speaking there are two main aspects to this study. Firstly we focus on the issue of how relational inexactness may be quantified. We illustra...
متن کاملGraph matching by relaxation of fuzzy assignments
Graphs are very powerful and widely used representational tools in computer applications. In this paper, we present a relaxation approach to (sub)graph matching based on a fuzzy assignment matrix. The algorithm has a computational complexity of ( 2 ) where and are the number of nodes in the two graphs being matched, and can perform both exact and inexact matching. To illustrate the performance ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 1999
ISSN: 0167-8655
DOI: 10.1016/s0167-8655(99)00071-9